翻訳と辞書 Words near each other ・ Firidun Guliyev ・ Firies ・ Firin' in Fouta ・ Firin' Squad ・ Firin' Up ・ Firing (disambiguation) ・ Firing at a vehicle ・ Firing Line ・ Firing Line (horse) ・ Firing of Shirley Sherrod ・ Firing order ・ Firing pin ・ Firing points ・ Firing Squad (album) ・ Firing squad (disambiguation) ・ Firing squad synchronization problem ・ Firing the Cathedral ・ Firinghi Kalibari ・ Firingoti ・ Firiplaka ・ Firishta ・ Firiya Sultanova ・ Firiza River ・ Firizan River ・ Firjan ・ FIRJAN System ・ Firkin ・ Firkin (unit) ・ Firkin Brewery ・ Firkins (surname) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Firing squad synchronization problem ： ウィキペディア英語版 Firing squad synchronization problem The firing squad synchronization problem is a problem in computer science and cellular automata in which the goal is to design a cellular automaton that, starting with a single active cell, eventually reaches a state in which all cells are simultaneously active. It was first proposed by John Myhill in 1957 and published (with a solution) in 1962 by Edward Moore. ==Problem statement== The name of the problem comes from an analogy with real-world firing squads: the goal is to design a system of rules according to which an officer can so command an execution detail to fire that its members fire their rifles simultaneously. More formally, the problem concerns cellular automata, arrays of finite state machines called "cells" arranged in a line, such that at each time step each machine transitions to a new state as a function of its previous state and the states of its two neighbors in the line. For the firing squad problem, the line consists of a finite number of cells, and the rule according to which each machine transitions to the next state should be the same for all of the cells interior to the line, but the transition functions of the two endpoints of the line are allowed to differ, as these two cells are each missing a neighbor on one of their two sides. The states of each cell include three distinguished states: "active", "quiescent", and "firing", and the transition function must be such that a cell that is quiescent and whose neighbors are quiescent remains quiescent. Initially, at time , all states are quiescent except for the cell at the far left (the general), which is active. The goal is to design a set of states and a transition function such that, no matter how long the line of cells is, there exists a time such that every cell transitions to the firing state at time , and such that no cell belongs to the firing state prior to time . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Firing squad synchronization problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.